-
1 lexicographic maximum
English-Russian electronics dictionary > lexicographic maximum
-
2 lexicographic maximum
The New English-Russian Dictionary of Radio-electronics > lexicographic maximum
-
3 maximum
максимум || максимальный- acute maximum
- boundary maximum
- broad maximum
- conditional maximum
- constrained maximum
- global maximum
- interior maximum
- isolated maximum
- lexicographic maximum
- local maximum
- narrow maximum
- principal maximum
- relative maximum
- sharp maximum -
4 maximum
максимум || максимальный- acute maximum
- boundary maximum
- broad maximum
- conditional maximum
- constrained maximum
- global maximum
- interior maximum
- isolated maximum
- lexicographic maximum
- local maximum
- narrow maximum
- principal maximum
- relative maximum
- sharp maximumThe New English-Russian Dictionary of Radio-electronics > maximum
-
5 matching
1) подгонка2) согласование; подбор; пригонка; сочетание3) соответствие4) сопоставление, сравнение5) метал. сборка листов в пакет6) т. граф. паросочетание7) согласующий•pennies matching with imperfect spying — т. игр сравнение монет с неполным подглядыванием
- maximum matching - maximum weight matchingpennies matching with spying — т. игр сравнение монет с подглядыванием
См. также в других словарях:
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
Goal programming — is a branch of multiobjective optimization, which in turn is a branch of multi criteria decision analysis (MCDA), also known as multiple criteria decision making (MCDM). It can be thought of as an extension or generalisation of linear programming … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
Price of anarchy — The price of anarchy is a concept from game theory that describes the difference in maximum social utility and the utility of an equilibrium point of the game.DefinitionGiven a game G=(N,A,u), it is natural to consider the social welfare , i.e.… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Chordal graph — A cycle (black) with two chords (green). As for this part, the graph is chordal. However, removing one green edge would result in a non chordal graph. Indeed, the other green edge with three black edges would form a cycle of length four with no… … Wikipedia
Controlled vocabulary — Controlled vocabularies provide a way to organize knowledge for subsequent retrieval. They are used in subject indexing schemes, subject headings, thesauri, taxonomies and other form of knowledge organization systems. Controlled vocabulary… … Wikipedia
North America — North American. the northern continent of the Western Hemisphere, extending from Central America to the Arctic Ocean. Highest point, Mt. McKinley, 20,300 ft. (6187 m); lowest, Death Valley, 276 ft. (84 m) below sea level. 400,000,000 including… … Universalium
1 (number) — One redirects here. For other uses, see 1 (disambiguation). 1 −1 0 1 2 3 4 5 6 7 8 9 → List of numbers Integers … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia